A Coalgebraic presentation of structured transition systems
نویسندگان
چکیده
This paper relates labelled transition systems and coalgebras with the motivation of comparing and combining their complementary contributions to the theory of concurrent systems. The well-known mismatch between these two notions concerning the morphisms is resolved by extending the coalgebraic framework by lax cohomomorphisms. Enriching both labelled transition systems and coalgebras with algebraic structure for an algebraic speci/cation, the correspondence is lost again. This motivates the introduction of lax coalgebras, where the coalgebra structure is given by a lax homomorphism. The resulting category of lax coalgebras and lax cohomomorphisms for a suitable endofunctor is shown to be isomorphic to the category of structured transition systems, where both states and transitions form algebras. The framework is also presented on a more abstract categorical level using monads and comonads, extending the bialgebraic approach introduced by Turi and Plotkin. c © 2001 Elsevier Science B.V. All rights reserved.
منابع مشابه
ON ALGEBRAIC AND COALGEBRAIC CATEGORIES OF VARIETY-BASED TOPOLOGICAL SYSTEMS
Motivated by the recent study on categorical properties of latticevalued topology, the paper considers a generalization of the notion of topological system introduced by S. Vickers, providing an algebraic and a coalgebraic category of the new structures. As a result, the nature of the category TopSys of S. Vickers gets clari ed, and a metatheorem is stated, claiming that (latticevalu...
متن کاملOn a coalgebraic view on Logic
In this paper we present methods of transition from one perspective on logic to others, and apply this in particular to obtain a coalgebraic presentation of logic. The central ingredient in this process is to view consequence relations as morphisms in a category.
متن کاملOn Logics for Coalgebraic Simulation
We investigate logics for coalgebraic simulation from a compositional perspective. Specifically, we show that the expressiveness of an inductively-defined language for coalgebras w.r.t. a given notion of simulation comes as a consequence of an expressivity condition between the language constructor used to define the language for coalgebras, and the relator used to define the notion of simulati...
متن کاملTrace semantics via determinization for probabilistic transition systems
A coalgebraic definition of finite and infinite trace semantics for probabilistic transition systems has recently been given using a certain Kleisli category. In this paper this semantics is developed using a coalgebraic method which is an instance of general determinization. Once applied to discrete systems, this point of view allows the exploitation of the determinized structure by up-to tech...
متن کاملA Coalgebraic Representation of Reduction by Cone of Influence
The Cone of Influence Reduction is a fundamental abstraction technique for reducing the size of models used in symbolic model checking. We develop coalgebraic representations of systems as composites of state transition maps and connectors. These representations include synchronous systems, asynchronous systems, asynchronous systems with synchronization by channels, and those with shared variab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 260 شماره
صفحات -
تاریخ انتشار 2001